Refinements of the integral Jensen’s inequality generated by finite or infinite permutations

نویسندگان

چکیده

Abstract There are a lot of papers dealing with applications the so-called cyclic refinement discrete Jensen’s inequality. A significant generalization refinement, based on combinatorial considerations, has recently been discovered by author. In present paper we give integral versions these results. On one hand, new method to refine inequality is developed. other result contains some recent refinements as elementary cases. Finally Fejér (especially Hermite–Hadamard inequality), quasi-arithmetic means, and f -divergences presented.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generated topology on infinite sets by ultrafilters

Let $X$ be an infinite set, equipped with a topology $tau$. In this paper we studied the relationship between $tau$, and ultrafilters on $X$. We can discovered, among other thing, some relations of the Robinson's compactness theorem, continuity and the separation axioms. It is important also, aspects of communication between mathematical concepts.

متن کامل

Refinements of Pinsker's inequality

Let V and D denote, respectively, total variation and divergence. We study lower bounds of D with V fixed. The theoretically best (i.e. largest) lower bound determines a function L = L(V ), Vajda’s tight lower bound, cf. Vajda, [?]. The main result is an exact parametrization of L. This leads to Taylor polynomials which are lower bounds for L, and thereby extensions of the classical Pinsker ine...

متن کامل

On the Permutations Generated by Cyclic Shift

The set of permutations generated by cyclic shift is studied using a number system coding for these permutations. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code describing structural and symmetry properties of the set of permutations ordered according to generation by cyclic shift. The code is...

متن کامل

Representations of Infinite Permutations by Words (ii)

We present an argument (due originally to R. C. Lyndon) which completes the proof of the following theorem: Every free group word which is not a proper power can represent any permutation of an infinite set.

متن کامل

Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series

We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutations of length 5, 6, 7 and 8. We prove this via a “canonical” generating algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Inequalities and Applications

سال: 2021

ISSN: ['1025-5834', '1029-242X']

DOI: https://doi.org/10.1186/s13660-021-02545-7